Real - Life Employee Timetabling Problem : Instance Example
نویسندگان
چکیده
This technical report focuses on a concrete instance of the real-life employee timetabling problem presented in the paper “Applying CP(FD), CLP(FD) and CFLP(FD) to a Real-Life Employee Timetabling Problem”. It provides additional material that would help the reader of the paper in both understanding the algorithm proposed as well as the code of the models provided online.
منابع مشابه
Solving Employee Timetabling Problems by Generalized Local Search
Employee timetabling is the operation of assigning employees to tasks in a set of shifts during a xed period of time. We present a general deenition of employee timetabling problems (ETPs) that captures many real world problem formulations and includes complex constraints. We investigate the use of several local search techniques for solving ETPs. In particular , we propose a generalization of ...
متن کاملCut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
متن کاملSolving Timetabling Problems Using Genetic Algorithms Based on Minimizing Conflict Heuristics
This paper describes techniques that can be applied to large-scale real-life employee timetabling problems. The problems are characterized as constraint satisfaction problems. The solution methodology uses genetic algorithms to minimize the total penalty for constraint violation. An encoding for search space reduction, genetic operation for a quick accumulation of partial solutions, and a penal...
متن کاملCombining rules and constraints for employee timetabling
Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach is to model human knowledge which is commonly used for solving such problems into knowledge-based systems for timetabling. It is diicult to represent the complex constraints of timetabling explicitly in constraint networks. On the other hand,...
متن کاملSolving the Course-timetabling Problem of Cairo University Using Max-SAT
Due to the good performance of current SAT (satisfiability) and MaxSAT (maximum satisfiability) solvers, many real-life optimization problems such as scheduling can be solved by encoding them into Max-SAT. In this paper we tackle the course timetabling problem of the department of mathematics, Cairo University by encoding it into Max-SAT. Generating timetables for the department by hand has pro...
متن کامل